Revisiting Worst-Case DEA for Composite Indicators
نویسندگان
چکیده
منابع مشابه
Creating composite indicators with DEA and robustness analysis: the case of the Technology Achievement Index
Composite indicators (CIs) are often used for benchmarking countries’ performance, but they frequently stir controversies about the unavoidable subjectivity in their construction. Data Envelopment Analysis helps to overcome some key limitations, as it does not need any prior information on either the normalization of sub-indicators or on an agreed unique set of weights. Still, subjective decisi...
متن کاملData Envelopment Analysis (DEA) assessment of composite indicators of infrastructure endowment
In Data Envelopment Analysis the distance from the best practice frontier can be interpreted as the economic performance of sample units. In the present paper this distance is used as an efficiency measure to correct the weighted average of non-substitutable subindicators of infrastructure endowment.
متن کاملThe worst-practice DEA model with slack-based measurement
An original data envelopment analysis (DEA) model is to evaluate each decision-making unit (DMU) with a set of most favorable weights of performance indices. The efficient DMUs obtained from the original DEA construct an efficient (bestpractice) frontier. The original DEA can be considered to identify good (efficient) performers in the most favorable scenario. For the purpose of identifying bad...
متن کاملWorst - case
In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the eeectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a very simple network leads to some interesting mathematics, results, and open problems.
متن کاملExact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
We provide a framework for computing the exact worst-case performance of any algorithm belonging to a broad class of oracle-based first-order methods for composite convex optimization, including those performing explicit, projected, proximal, conditional and inexact (sub)gradient steps. We simultaneously obtain tight worst-case convergence guarantees and explicit problems on which the algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2015
ISSN: 1556-5068
DOI: 10.2139/ssrn.2568575